Results on the Propositional µ-Calculus
نویسنده
چکیده
Abstrack In this paper we define and study a propositional p-calculur Lp, which consists essentialI) ol propositional modal logic with a least fixpoint operator. Lp is syntactically simpler yet strictly nwc exprcsk~e than Propositional Dqnamic Logic (PDL). For a rtxtrictcd version \\L‘ give an cuponcntinl-time decision procedure. small model prcqwty. and complete deductive system. thcri,, wbuming the corresponding results for PDL.
منابع مشابه
Automatic Abstraction Techniques for Propositional µ-calculus Model Checking
An abstraction/reenement paradigm for the full propositional-calculus is presented. No distinction is made between universal or ex-istential fragments. Necessary conditions for conservative veriication are provided, along with a fully automatic symbolic model checking abstraction algorithm. The algorithm begins with conservative veriication of an initial abstraction. If the conclusion is negati...
متن کاملOn the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the formalization of modal (sequent-style) rules and of context sensitive grammars. The formalization c...
متن کاملFormalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (sequent-style) rules and of context sensitive grammars. The formalization can be...
متن کاملSimilarity DH-Algebras
In cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...
متن کاملModel checking algorithms for the µ-calculus
The propositional-calculus is a powerful language for expressing properties of transition systems by using least and greatest xpoint operators. Recently, the-calculus has generated much interest among researchers in computer-aided veriication. This interest stems from the fact that many temporal and program logics can be encoded into the-calculus. In addition, important relations between transi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 27 شماره
صفحات -
تاریخ انتشار 1982